VAR-PAGE-LRU A Buffer Replacement Algorithm Supporting Different Page Sizes

نویسنده

  • Andrea Sikeler
چکیده

Non-standard applications (such as CAD/CAM etc.) require new concepts and implementation techniques at each layer of an appropriate database management system. The buffer manager, for example, should support either different page sizes, set-oriented operations on pages, or both in order to deal with large objects in an efficient way. However, implementing different page sizes causes some new buffer management problems concerning search within the buffer, buffer allocation, and page replacement. Assuming a global buffer allocation strategy, we introduce a page replacement algorithm which determines several pages stored in subsequent buffer frames to be replaced for a requested page. First investigations prove the algorithm to be a promising solution for buffer management with different page sizes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Impact of Buffering on Closest Pairs Queries Using R-Trees

In this paper, the most appropriate buffer structure, page replacement policy and buffering scheme for closest pairs queries, where both spatial datasets are stored in R-trees, are investigated. Three buffer structures (i.e. single, hybrid and by levels) over two buffering schemes (i.e. local to each R-tree, and global to the query) using several page replacement algorithms (e.g. FIFO, LRU, 2Q,...

متن کامل

VLRU: Buffer Management in Client-Server Systems

In a client-server system, when LRU or its variant buffer replacement strategy is used on both the client and the server, the cache performance on the server side is very poor mainly because of pages duplicated in both systems. This paper introduces a server buffer replacement strategy which uses a replaced page-id than a request page-id, for the primary information for its operations. The impo...

متن کامل

A Robust and Self-tuning Page-Replacement Strategy for Spatial Database Systems

For a spatial database management system, it is an important goal to minimize the I/O-cost of queries and other operations. Several page-replacement strategies have been proposed and compared for standard database systems. In the context of spatial database systems, however, the impact of buffing techniques has not been considered in detail, yet. In this paper, different page-replacement algori...

متن کامل

FFU: Far-Future-Using Replacement Algorithms for Continuous Media Storage System

It is true that some conventional algorithms do not fit in Continuous Media (CM) environments because of their different properties. A typical example is the buffer replacement algorithmssuch as least recently used (LRU) and most recently used (MRU) strategies. These replacement policies are based on the referencing history for replacing buffered page with lower priority because it is not alway...

متن کامل

Effect of Replacement Algorithms on a Paged Buffer Database System

In a database system a buffer may be used to hold recently referenced pages. If this buffer is in virtual memory, the database paging system and the memory paging system affect its performance. The study of the effect of main memory replacement algorithms on the number of main memory page faults is the basic objective of this paper. We assume that the buffer replacement algorithm is least recen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1988